Polynomial reduction of time–space scheduling to time scheduling
نویسندگان
چکیده
منابع مشابه
Link scheduling in polynomial time
Two pols nomial time algorithms are given for scheduling conversations in a spread spectrum radio networh. The constraint on converrations is that each station can conver\e with at most one other station at a time. The first algorithm is strongly polynomial and finds a schedule of minimum length which allows each pair of neighboring stations to directly converse for a prescribed length of time....
متن کاملPolynomial-time approximation schemes for scheduling problems with time lags
We identify two classes of machine scheduling problems with time lags that possess Polynomial-Time Approximation Schemes (PTASs). These classes together, one for minimizing makespan and one for minimizing total completion time, include many well-studied time lag scheduling problems. The running times of these approximation schemes are polynomial in the number of jobs, but exponential in the num...
متن کاملPolynomial Time Algorithms for Scheduling of Arrival Aircraft
A Mixed Integer Linear Program (MILP) formulation of an arrival traffic scheduling problem is used as the starting point in order to evaluate the respective capabilities of two real-time scheduling algorithms. Three main issues are addressed: computational time, suboptimality and statistical performance. The first algorithm is an approximation algorithm, which is polynomial time and has a guara...
متن کاملPreemptive Scheduling of Equal-Length Jobs in Polynomial Time
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighted completion times ∑n i=1 wiCi of the jobs. We propose for this problem the first parameterized algorithm on the number k of different weights. The runtime of the proposed algorithm is O(( n k + 1)n) and hence, the pr...
متن کاملPolynomial time approximation algorithms for machine scheduling: Ten open problems
We discuss what we consider to be the ten most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Prologue In the early days of scheduling, the work of the theoretical research branch mainly consist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.10.014